Monochromatic Clique Decompositions of Graphs
نویسندگان
چکیده
منابع مشابه
Monochromatic Clique Decompositions of Graphs
Let G be a graph whose edges are colored with k colors, and H=(H1,⋯,Hk) be a k-tuple of graphs. A monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic copy of Hi in color i, for some 1≤i≤k. Let φk(n,H) be the smallest number ϕ, such that, for every order-n graph and every k-edge-coloring, there is a monochrom...
متن کاملMonochromatic Kr-Decompositions of Graphs
Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let φk(n,H) be the smallest number φ such that any k-edge-coloured graph G of order n, admits a monochromatic H-decomposition with at most φ parts. Here we stud...
متن کاملMonochromatic KrKr-Decompositions of Graphs
Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let φk(n,H) be the smallest number φ such that any graph G of order n and any colouring of its edges with k colours, admits a monochromatic Hdecomposition with ...
متن کاملDecompositions of edge-colored infinite complete graphs into monochromatic paths
For r ∈ N\{0} an r-edge coloring of a graph or hypergraph G = (V,E) is a map c : E → {0, . . . , r−1}. Extending results of Rado and answering questions of Rado, Gyárfás and Sárközy we prove that • every r-edge colored complete k-uniform hypergraph on N can be partitioned into r monochromatic tight paths with distinct colors (a tight path in a kuniform hypergraph is a sequence of distinct verti...
متن کاملMonochromatic K r - Decompositions of Graphs ( Extended Abstract )
Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let φk(n,H) be the smallest number φ such that any k-edge-coloured graph G of order n, admits a monochromatic H-decomposition with at most φ parts. Here we stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2015
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.21851